Routing with Maximum EDPs and Wavelength Assignment with Path Conflict Graphs
نویسندگان
چکیده
The routing and wavelength assignment problem is one of the most important issues in optical transport networks based on the Wavelength Division Multiplexing (WDM) technique. In this paper, a novel approach using path conflict graphs and an algorithm for finding all edge disjoint paths is proposed. The performance of the proposed algorithm is compared with that of the bounded greedy approach for EDP (BGAforEDP). The proposed algorithm outperforms by approximately 20% under the traditional fixed topology (NSFNET) and approximately 32% under random topologies, using the BGAforEDP algorithm.
منابع مشابه
RWA Based on Approximated Path Conflict Graphs in Optical Networks
Among many solutions to Routing and Wavelength Assignment (RWA) problems based on Edge Disjoint Paths (EDP), the Path Conflict Graph (PCG) algorithm shows outstanding performance in terms of wavelength. In this paper, we improve the PCG algorithm by imposing limitations on the EDPs length based on the fact that the EDPs are longer than the average length for the rarely selected demands. We conc...
متن کاملA Novel Protection Guaranteed, Quality of Transmission Aware Routing and Wavelength Assignment Algorithm for All-optical Networks
Transparent All Optical Networks carry huge traffic and any link failure can cause the loss of gigabits of data; hence protection and its guarantee becomes necessary at the time of failure. Many protection schemes were presented in the literature, but none of them speaks about protection guarantee. Also, in all optical networks, due to absence of regeneration capabilities, the physical layer i...
متن کاملA Study on the Transportation Period of the EPG Data Specification in Terrestrial DMB
The routing and wavelength assignment problem is one of the most important issues in optical transport networks based on the Wavelength Division Multiplexing (WDM) technique. In this paper, a novel approach using path conflict graphs and an algorithm for finding all edge disjoint paths is proposed. The performance of the proposed algorithm is compared with that of the bounded greedy approach fo...
متن کاملProof: for Any Connection Set with Load L and All Path- Lengths No Greater than L, We Construct the Path-conflict Graph. Each Connection Shares a Link with at Most L(l ? 1)
others. So the degree of path-conflict graph is at most l(L ? 1). Then we need at most l(L ? 1) + 1 colors for vertex-coloring the path-conflict graph. So !(1) l(L?1). By the first lemma, !(k) d(l(L ? 1) + 1)=ke. 8 Conclusion In this paper, we considered the wavelength assignment problem in multifiber networks, in which each link has exactly k parallel fibers. Our results for star and ring netw...
متن کاملRouting and Wavelength Assignment for Constraint Based Optical Networks Using Modified Dwp Algorithm
A new approach to constraint-based path selection for dynamic routing and wavelength allocation in optical networks based on Wavelength Division Multiplexing (WDM) has been proposed. The Distributed discovery wavelength path selection algorithm (DWP) proposed in the previous work takes a longer time for path selection even though it could solve some conflicting constraints imposed by electronic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006